Self-Modifying Finite Automata

نویسندگان

  • Roy S. Rubinstein
  • John N. Shutt
چکیده

We present here a new model of computation: the Self-Modifying Finite Automaton (SMFA). This is similar to a standard nite automaton, but changes to the machine are allowed during a computation. It is shown here that a weak form of this model has the power to recognize an important class of context-free languages, the metalinear languages, as well as some signi cant non-context-free languages. Less restricted forms of SMFA's may accept even more.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-modifying Finite Automata | Power and Limitations Self-modifying Finite Automata | Power and Limitations

The Self-Modifying Finite Automaton (SMFA) is a model of computation introduced in [RS93, RS94, RS95b]. Formal de nitions appear in [RS95a]. This paper further investigates the computational power of the model, and introduces the concepts of path determinism and register complexity.

متن کامل

Self-modifying Finite Automata | Basic Deenitions and Results Self-modifying Finite Automata | Basic Deenitions and Results

We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...

متن کامل

Self-Modifying Finite Automata - Basic Definitions and Results

We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...

متن کامل

Unveiling metamorphism by abstract interpretation of code properties

a r t i c l e i n f o a b s t r a c t Abstract interpretation Program semantics Metamorphic malware detection Self-modifying programs Metamorphic code includes self-modifying semantics-preserving transformations to exploit code diversification. The impact of metamorphism is growing in security and code protection technologies, both for preventing malicious host attacks, e.g., in software divers...

متن کامل

GAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING

In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994